for _ in range(int(input())):
n = int(input())
a = sum(list(map(int, input().split())))
b = list(map(int, input().split()))
print(a + sum(b) - max(b))#include<cstdio>
#include<iostream>
#define int long long
using namespace std;
const int N=1e6+10;
int a[N],b[N],st[10][10];
signed main()
{
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
int sum=0;
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
sum+=a[i];
}
int ma=0;
for(int i=1;i<=n;++i)
{
scanf("%d",&b[i]);
sum+=b[i];
ma=max(ma,b[i]);
}
sum-=ma;
cout<<sum<<'\n';
}
return 0;
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |